全文获取类型
收费全文 | 14244篇 |
免费 | 1683篇 |
国内免费 | 571篇 |
专业分类
化学 | 5805篇 |
晶体学 | 82篇 |
力学 | 1684篇 |
综合类 | 72篇 |
数学 | 6013篇 |
物理学 | 2842篇 |
出版年
2023年 | 178篇 |
2022年 | 148篇 |
2021年 | 287篇 |
2020年 | 474篇 |
2019年 | 360篇 |
2018年 | 339篇 |
2017年 | 337篇 |
2016年 | 582篇 |
2015年 | 570篇 |
2014年 | 718篇 |
2013年 | 1173篇 |
2012年 | 809篇 |
2011年 | 834篇 |
2010年 | 623篇 |
2009年 | 921篇 |
2008年 | 828篇 |
2007年 | 893篇 |
2006年 | 752篇 |
2005年 | 597篇 |
2004年 | 565篇 |
2003年 | 554篇 |
2002年 | 466篇 |
2001年 | 439篇 |
2000年 | 412篇 |
1999年 | 331篇 |
1998年 | 342篇 |
1997年 | 276篇 |
1996年 | 230篇 |
1995年 | 190篇 |
1994年 | 151篇 |
1993年 | 142篇 |
1992年 | 112篇 |
1991年 | 96篇 |
1990年 | 83篇 |
1989年 | 59篇 |
1988年 | 66篇 |
1987年 | 58篇 |
1986年 | 59篇 |
1985年 | 42篇 |
1984年 | 61篇 |
1983年 | 20篇 |
1982年 | 31篇 |
1981年 | 35篇 |
1980年 | 25篇 |
1979年 | 28篇 |
1978年 | 47篇 |
1977年 | 44篇 |
1976年 | 43篇 |
1975年 | 16篇 |
1974年 | 15篇 |
排序方式: 共有10000条查询结果,搜索用时 250 毫秒
81.
本文结合代数教学中的实际情况.针对代数教学过程中出现的问题。提出了在代数教学过程中改进教学方法的几条措施. 相似文献
82.
S. B. Bushuk Yu. A. Kal'vinkovskaya A. N. Rubinov 《Journal of Applied Spectroscopy》2004,71(2):291-294
Capture of an ensemble of polymeric microspheres in a water suspension under the action of optical gradient forces in the field of interfering laser beams has been investigated for the case of two-, three-, and four-beam interference. The self-diffraction and diffraction of radiation on induced ordered spatial distribution of particles have been obtained. 相似文献
83.
84.
Some previous works show that symmetric fixed- and variable-stepsize linear multistep methods for second-order systems which do not have any parasitic root in their first characteristic polynomial give rise to a slow error growth with time when integrating reversible systems. In this paper, we give a technique to construct variable-stepsize symmetric methods from their fixed-stepsize counterparts, in such a way that the former have the same order as the latter. The order and symmetry of the integrators obtained is proved independently of the order of the underlying fixed-stepsize integrators. As this technique looks for efficiency, we concentrate on explicit linear multistep methods, which just make one function evaluation per step, and we offer some numerical comparisons with other one-step adaptive methods which also show a good long-term behaviour.
85.
86.
Jean-Pierre Dedieu Gregorio Malajovich Mike Shub 《Foundations of Computational Mathematics》2005,5(2):145-171
We prove a linear bound on the average total curvature of the
central path of linear programming theory in terms of the number
of independent variables of the primal problem, and independent of
the number of constraints. 相似文献
87.
Numerical schemes for systems with multiple spatio-temporal scales are investigated. The multiscale schemes use asymptotic results for this type of systems which guarantee the existence of an effective dynamics for some suitably defined modes varying slowly on the largest scales. The multiscale schemes are analyzed in general, then illustrated on a specific example of a moderately large deterministic system displaying chaotic behavior due to Lorenz. Issues like consistency, accuracy, and efficiency are discussed in detail. The role of possible hidden slow variables as well as additional effects arising on the diffusive time-scale are also investigated. As a byproduct we obtain a rather complete characterization of the effective dynamics in Lorenz model. 相似文献
88.
共轭下降法的全局收敛性 总被引:3,自引:0,他引:3
本文提出了一种Armijo型的线搜索,并在这种线搜索下讨论了共轭下降法的全局收敛性,且可得方法在每次迭代均产生一个下降搜索方向. 相似文献
89.
基于增广Lagrange函数的RQP方法 总被引:3,自引:0,他引:3
Recursive quadratic programming is a family of techniques developd by Bartholomew-Biggs and other authors for solving nonlinear programming problems.This paperdescribes a new method for constrained optimization which obtains its search di-rections from a quadratic programming subproblem based on the well-known aug-mented Lagrangian function.It avoids the penalty parameter to tend to infinity.We employ the Fletcher‘s exact penalty function as a merit function and the use of an approximate directional derivative of the function that avoids the need toevaluate the second order derivatives of the problem functions.We prove that thealgorithm possesses global and superlinear convergence properties.At the sametime, numerical results are reported. 相似文献
90.
The state of the art iterative method for solving large linear systems is the conjugate gradient (CG) algorithm. Theoretical convergence analysis suggests that CG converges more rapidly than steepest descent. This paper argues that steepest descent may be an attractive alternative to CG when solving linear systems arising from the discretization of ill-posed problems. Specifically, it is shown that, for ill-posed problems, steepest descent has a more stable convergence behavior than CG, which may be explained by the fact that the filter factors for steepest descent behave much less erratically than those for CG. Moreover, it is shown that, with proper preconditioning, the convergence rate of steepest descent is competitive with that of CG.This revised version was published online in October 2005 with corrections to the Cover Date. 相似文献